Constructing and matching fuzzy graphs of volumetric primitives hypotheses

نویسندگان

  • Guillaume-Alexandre Bilodeau
  • Robert Bergevin
چکیده

In practical image querying applications, complex graphs often have to be compared to verify the similarity between two models. Since there is always uncertainty while models are constructed, the nodes and the edges require fuzzy attributes to properly describe the scene or the object. This paper addresses the problem of matching graphs with fuzzy attributes (GFAs) obtained by hypothesizing volumetric primitives from 2D parts. The GFAs of interests have nodes with many fuzzy attributes that correspond to volumetric hypotheses, and edges that describe the spatial relationship between the hypothesized volumetric primitives. A model for representing 2D parts by volumetric primitives is presented. Then, a method using structural indexing adapted to GFAs is proposed. This inexact matching method has been designed for matching GFAs in large databases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matching Graphs with Fuzzy Attributes in Machine Vision

G.A. Bilodeau and R. Bergevin Laboratoire de vision et systèmes numériques, Pavillon Adrien-Pouliot Université Laval, Sainte-Foy (QC), Canada, G1K 7P4 [email protected], [email protected] Abstract In object recognition and image querying applications, complex graphs often have to be compared to verify the similarity between two models. Since there is always uncertainty while models ar...

متن کامل

Class-based Recognition of 3D Objects Represented by Volumetric Primitives

This paper presents a novel approach to recognizing 3D complex objects that have similar geometric structure but belong to diierent sub-classes. Test scenes are acquired by a laser striper as range images, and the objects are modelled using a composite volumetric representation of superquadrics and geons. Matching is decomposed into two stages: rst, an indexing scheme designed to make eeective ...

متن کامل

Coverings, matchings and paired domination in fuzzy graphs using strong arcs

The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...

متن کامل

Fuzzy Forcing Set on Fuzzy Graphs

The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...

متن کامل

Modeling of 2D Parts Applied to Database Query

This paper presents recent developments in a project aimed at the design of an image database query engine, where the images are searched using 3D part-based object models. This is a novelty since most existing image database query engines search images by comparing colors, textures and 2D shape of regions in the images. In our project, 3D part-based models are built from qualitative volumetric...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003